Configuring the neighbourhood effect in irregular cellular automata based models
نویسندگان
چکیده
منابع مشابه
Dynamic Neighbourhood Cellular Automata
We propose a defi nition of Cellular Automaton in which links between cells can change during the computation. This is done locally by each cell, which can reach the neighbours of its neighbours in a single computational step. We suggest that Dynamic Neighbourhood Cellular Automata can serve as a theoretical model for studying Algorithmic and Computational Complexity issues in the are of Ubiqui...
متن کاملIrregular cellular learning automata-based algorithm for sampling social networks
Since online social networks usually have quite huge size and limited access, smaller subgraphs of them are often produced and analysed as the representative samples of original graphs. Sampling algorithms proposed so far are categorized into three main classes: node sampling, edge sampling, and topology-based sampling. Classic node sampling algorithm, despite its simplicity, performs surprisin...
متن کاملModeling the Sinoatrial Node by Cellular Automata with Irregular Topology
The role of irregularity in intercellular connections is studied in the first natural human pacemaker called the sinoatrial node by modeling with the Greenberg–Hastings cellular automata. Facts from modern physiology about the sinoatrial node drive modeling. Heterogeneity between cell connections is reproduced by a rewiring procedure applied to a square lattice. The Greenberg–Hastings rule, rep...
متن کاملFour Neighbourhood Cellular Automata as Better Cryptographic Primitives
Three-neighbourhood Cellular Automata (CA) are widely studied and accepted as suitable cryptographic primitive. Rule 30, a 3-neighbourhood CA rule, was proposed as an ideal candidate for cryptographic primitive by Wolfram. However, rule 30 was shown to be weak against Meier-Staffelbach attack [7]. The cryptographic properties like diffusion and randomness increase with increase in neighbourhood...
متن کاملSimple Cellular Automata-Based Linear Models for the Shrinking Generator
Structural properties of two well-known families of keystream generators, Shrinking Generators and Cellular Automata, have been analyzed. Emphasis is on the equivalence of the binary sequences obtained from both kinds of generators. In fact, Shrinking Generators (SG) can be identified with a subset of linear Cellular Automata (mainly rule 90, rule 150 or a hybrid combination of both rules). The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Geographical Information Science
سال: 2016
ISSN: 1365-8816,1362-3087
DOI: 10.1080/13658816.2016.1219035